Using Bayesian Networks to Direct Stochastic Search in Inductive Logic Programming
نویسندگان
چکیده
Stochastically searching the space of candidate clauses is an appealing way to scale up ILP to large datasets. We address an approach that uses a Bayesian network model to adaptively guide search in this space. We examine guiding search towards areas that previously performed well and towards areas that ILP has not yet thoroughly explored. We show improvement in area under the curve for recall-precision curves using these modifications.
منابع مشابه
Balios - The Engine for Bayesian Logic Programs
Inductive Logic Programming (ILP) [4] combines techniques from machine learning with the representation of logic programming. It aims at inducing logical clauses, i.e, general rules from specific observations and background knowledge. Because of focusing on logical clauses, traditional ILP systems do not model uncertainty explicitly. On the other hand, state-of-the-art probabilistic models such...
متن کاملStatistical Relational Learning: An Inductive Logic Programming Perspective
In the past few years there has been a lot of work lying at the intersection of probability theory, logic programming and machine learning [14, 18, 13, 9, 6, 1, 11]. This work is known under the names of statistical relational learning [7, 5], probabilistic logic learning [4], or probabilistic inductive logic programming. Whereas most of the existing works have started from a probabilistic lear...
متن کاملLearning Stochastic Logic Programs
Stochastic Logic Programs (SLPs) have been shown be a generalisation of Hidden Markov Models (HMMs), stochastic context-free grammars, and directed Bayes’ nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a first-order range-restricted definite clause. This paper summarises the syntax, distributional semantics and proof techniqu...
متن کاملInduction as a Search Procedure
This chapter introduces Inductive Logic Programming from the perspective of search algorithms in Computer Science. It first briefly considers the Version Spaces approach to induction, and then focuses on Inductive Logic Programming: from its formal definition and main techniques and strategies, to priors used to restrict the search space and optimized sequential, parallel, and stochastic algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007